Single-Database Private Information Retrieval with Constant Communication Rate
نویسندگان
چکیده
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ logn is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical parameter settings whether the user is retrieving a single bit or very large blocks. For large blocks, our scheme achieves a constant “rate” (e.g., 0.2), even when the user-side communication is very low (e.g., two 1024-bit numbers). Our scheme and security analysis is presented using general groups with hidden smooth subgroups; the scheme can be instantiated using composite moduli, in which case the security of our scheme is based on a simple variant of the “Φ-hiding” assumption by Cachin, Micali and Stadler [2].
منابع مشابه
Efficient Private Information Retrieval
Informally, private information retrieval for k >= 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately retrieve any single bit out of the n bits of data stored in the database. In this model, “privacy” implies that the user retrieves the bit he is interested in but releases to each database nothing about ...
متن کاملGeneral constructions for information-theoretic private information retrieval
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved; specifically, in a t-private, k-server PIR protocol the database is replicated among k servers, and the user’s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexi...
متن کاملReplication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More speciically, based on the quadratic resid-uosity assumption, we present a single database, computationally-private information-retrieval scheme with O(n) communication complexity for any > 0.
متن کاملMulti-query Computationally-Private Information Retrieval with Constant Communication Rate
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains oblivious to the index of the record retrieved while the overall communication between the two parties is smaller than the database size. This problem has been extensively studied and is known as computationally private...
متن کاملSingle Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously the best result could only achieve polylogarithmic communication, and was based on certain less well-studied assumptions in number theory [CMS99]. On the contrary, our construction is based on Paillier’s cryptosystem [P9...
متن کامل